Contempt: Derogating Others While Keeping Calm

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extending Software Systems While Keeping Conceptual Integrity

Design and analysis of software systems in terms of their Conceptual Integrity is a demanding task. Nonetheless, progress has been made in recent years and actual software systems in practical use, such as Git, have been analyzed. In this work we make a further first step within the conceptual analysis approach, by asking how to extend software systems by addition of further components while ke...

متن کامل

Collapsing Riemannian Manifolds While Keeping Their Curvature Bounded. Ii

This is the second of two papers concerned with the situation in which the injectivity radius at certain points of a riemannian manifold is "small" compared to the curvature. In Part I [3], we introduced the concept of an F-structure of positive rank. This generalizes the notion of a torus action, for which all orbits have positive dimension. We showed that if a compact manifold, Y , admits an ...

متن کامل

Reconfigurable Wavelet Thresholding for Image Denoising while Keeping Edge Detection

This paper proposes an reconfigurable adaptive threshold estimation method for image denoising in the wavelet domain based on the generalized Guassian distribution (GGD) modeling of sub-band coefficients. The proposed method called RegularShrink is computationally more efficient and adaptive because the parameters required for estimating the threshold depend on sub-band data Edge information is...

متن کامل

Triangulating Planar Graphs While Keeping the Pathwidth Small

Any simple planar graph can be triangulated, i.e., we can add edges to it, without adding multi-edges, such that the result is planar and all faces are triangles. In this paper, we study the problem of triangulating a planar graph without increasing the pathwidth by much. We show that if a planar graph has pathwidth k, then we can triangulate it so that the resulting graph has pathwidth O(k) (w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Emotion Review

سال: 2016

ISSN: 1754-0739,1754-0747

DOI: 10.1177/1754073915610439